Domain Extenders for UOWHF: A Generi Lower Bound on Key Expansion and a Finite Binary Tree Algorithm
نویسنده
چکیده
منابع مشابه
New Parallel Domain Extenders for UOWHF
We present two new parallel algorithms for extending the domain of a UOWHF. The first algorithm is complete binary tree based construction and has less key length expansion than Sarkar’s construction which is the previously best known complete binary tree based construction. But only disadvantage is that here we need more key length expansion than that of Shoup’s sequential algorithm. But it is...
متن کاملConstruction of UOWHF: Two New Parallel Methods
We present two new parallel algorithms for extending the domain of a UOWHF. The first algorithm is complete binary tree based construction and has less key length expansion than Sarkar’s construction which is the previously best known complete binary tree based construction. But only disadvantage is that here we need more key length expansion than that of Shoup’s sequential algorithm. But it is...
متن کاملUpper bound and numerical analysis of cyclic expansion extrusion (CEE) process
Deformation of the material during cyclic expansion extrusion (CEE) is investigated using upper-bound theorem. The analytical approximation of forming loads agrees very well with the FEM results for different amounts of chamber diameter, friction factor and also for lower die angles. However, the difference between analytical and numerical solution increases at higher die angles which are expla...
متن کاملAn improved algorithm to reconstruct a binary tree from its inorder and postorder traversals
It is well-known that, given inorder traversal along with one of the preorder or postorder traversals of a binary tree, the tree can be determined uniquely. Several algorithms have been proposed to reconstruct a binary tree from its inorder and preorder traversals. There is one study to reconstruct a binary tree from its inorder and postorder traversals, and this algorithm takes running time of...
متن کاملBearing Capacity of Strip Footings near Slopes Using Lower Bound Limit Analysis
Stability of foundations near slopes is one of the important and complicated problems in geotechnical engineering, which has been investigated by various methods such as limit equilibrium, limit analysis, slip-line, finite element and discrete element. The complexity of this problem is resulted from the combination of two probable failures: foundation failure and overall slope failure. The curr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003